Speeding Up Constraint Propagation
نویسندگان
چکیده
This paper presents a model and implementation techniques for speeding up constraint propagation. Two fundamental approaches to improving constraint propagation are explored: keeping track of which propagators are at fixpoint, and choosing which propagator to apply next. We show how idempotence reasoning and events help track fixpoints more accurately. We improve these methods by using them dynamically (taking into account current domains to improve accuracy). We define priority-based approaches to choosing a next propagator and show that dynamic priorities can improve propagation. We illustrate that the use of multiple propagators for the same constraint can be advantageous with priorities, and introduce staged propagators which combine the effects of multiple propagators with priorities for greater efficiency.
منابع مشابه
Constraint Propagation and ProblemDecomposition : A Preprocessing
In recent years, constraint propagation techniques have been shown to be highly eeective for solving diicult scheduling problems. In this paper, we present an algorithm which combines constraint propagation with a problem decomposition approach in order to simplify the solution of the job shop scheduling problem. This is mainly guided by the observation that constraint propagation is more eeect...
متن کاملSpeeding Up Weighted Constraint Satisfaction Using Redundant Modeling
In classical constraint satisfaction, combining mutually redundant models using channeling constraints is effective in increasing constraint propagation and reducing search space for many problems. In this paper, we investigate how to benefit the same for weighted constraint satisfaction problems (WCSPs), a common soft constraint framework for modeling optimization and over-constrained problems...
متن کاملTechniques for Efficient Constraint Propagation
This thesis explores three new techniques for increasing the efficiency of constraint propagation: support for incremental propagation, improved representation of constraints, and abstractions to simplify propagation. Support for incremental propagation is added to a propagatorcentered propagation system by adding a new intermediate layer of abstraction, advisors, that capture the essential asp...
متن کاملSpeeding Up All-Pairwise Dynamic Time Warping Matrix Calculation
Dynamic Time Warping (DTW) is certainly the most relevant distance for time series analysis. However, its quadratic time complexity may hamper its use, mainly in the analysis of large time series data. All the recent advances in speeding up the exact DTW calculation are confined to similarity search. However, there is a significant number of important algorithms including clustering and classif...
متن کاملMemoisation for Constraint-Based Local Search
We present a memoisation technique for constraint-based local search based on the observation that penalties with respect to some interchangeable elements need only be calculated once. We apply the technique to constraint-based local search on set variables, and demonstrate the usefulness of the approach by significantly speeding up the penalty calculation of a commonly used set constraint.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004